金华地区电力通信基础网运维现状分析及维护建议

针对金华地区电力通信基础网的拓扑现状,结合地区网络发展的需求,讨论了基础网传输系统拓扑结构和运维现状存在的设备异常、板卡资源紧张、合理接入等问题,并就金华地区基础网系统拓扑结构层次的合理优化以及运行维护提出可行性建议。     

Testing local search move operators on the vehicle routing problem with split deliveries and time windows

The vehicle routing problem (VRP) is an important transportation problem. The literature addresses several extensions of this problem, including variants having delivery time windows associated with customers and variants allowing split deliveries to customers. The problem extension including both of these variations has received less attention in the literature. This research effort sheds further light on this problem. Specifically, this paper analyzes the effects of combinations of local search (LS) move operators commonly used on the VRP and its variants. We find when paired with a MAX-MIN Ant System constructive heuristic, Or-opt or 2-opt⁎ appear to be the ideal LS operators to employ on the VRP with split deliveries and time windows with Or-opt finding higher quality solutions and 2-opt⁎ requiring less run time.     

Product mix optimization for a semiconductor fab: Modeling approaches and decomposition techniques

To optimize the product mix of a semiconductor fab, the production capabilities and capacities are matched with the demand in the most profitable way. In this paper we address a linear programming model of the product mix problem considering product dependent demand limits (e.g. obligations and demand forecast) and profits while respecting the capacity bounds of the production facility. Since the capacity consumption is highly dependent on choosing from different production alternatives we are implicitly solving a static capacity planning problem for each product mix. This kind of planning approach is supported by the fluid flow concept and complete resource pooling in high traffic. We propose a general model that considers a wide range of objectives, and we introduce a heuristic that is based on the decomposition of the static capacity planning problem. A computational study reports on the quality of the decomposition approaches, and examples from practice demonstrate the versatility of the model.     

青龙山特大桥空间异形刚架桥设计及优化

空间刚架结构采用墩梁固结的构造，在竖向荷载作用下，能够利用固结端的负弯矩降低梁的跨中弯矩，从而达到减小梁高的目的。在桥下净空受限的情况下，根据刚架结构的力学特点，进行形状优化可极大地改善线路条件，更好适应地形。结合青龙山特大桥的设计，介绍了空间刚架结构的特点及不同桥式方案的选择。采用有限元方法对选取1号节段刚架进行验算，结果表明刚架各控制点参数均满足标准要求。空间异型刚架桥方案可为线路夹角小、净空受限的桥梁工程施工设计提供有益参考。     

A new particle swarm optimization algorithm with adaptive inertia weight based on Bayesian techniques

Particle swarm optimization is a stochastic population-based algorithm based on social interaction of bird flocking or fish schooling. In this paper, a new adaptive inertia weight adjusting approach is proposed based on Bayesian techniques in PSO, which is used to set up a sound tradeoff between the exploration and exploitation characteristics. It applies the Bayesian techniques to enhance the PSO's searching ability in the exploitation of past particle positions and uses the cauchy mutation for exploring the better solution. A suite of benchmark functions are employed to test the performance of the proposed method. The results demonstrate that the new method exhibits higher accuracy and faster convergence rate than other inertia weight adjusting methods in multimodal and unimodal functions. Furthermore, to show the generalization ability of BPSO method, it is compared with other types of improved PSO algorithms, which also performs well.     

An evolving surrogate model-based differential evolution algorithm

Differential evolution (DE) is a simple and effective approach for solving numerical optimization problems. However, the performance of DE is sensitive to the choice of mutation and crossover strategies and their associated control parameters. Therefore, to achieve optimal performance, a time-consuming parameter tuning process is required. In DE, the use of different mutation and crossover strategies with different parameter settings can be appropriate during different stages of the evolution. Therefore, to achieve optimal performance using DE, various adaptation, self-adaptation, and ensemble techniques have been proposed. Recently, a classification-assisted DE algorithm was proposed to overcome trial and error parameter tuning and efficiently solve computationally expensive problems. In this paper, we present an evolving surrogate model-based differential evolution (ESMDE) method, wherein a surrogate model constructed based on the population members of the current generation is used to assist the DE algorithm in order to generate competitive offspring using the appropriate parameter setting during different stages of the evolution. As the population evolves over generations, the surrogate model also evolves over the iterations and better represents the basin of search by the DE algorithm. The proposed method employs a simple Kriging model to construct the surrogate. The performance of ESMDE is evaluated on a set of 17 bound-constrained problems. The performance of the proposed algorithm is compared to state-of-the-art self-adaptive DE algorithms: the classification-assisted DE algorithm, regression-assisted DE algorithm, and ranking-assisted DE algorithm.     

Optimizing horizontal alignment of roads in a specified corridor

Finding an optimal alignment connecting two end-points in a specified corridor is a complex problem that requires solving three interrelated sub-problems, namely the horizontal alignment, vertical alignment and earthwork optimization problems. In this research, we developed a novel bi-level optimization model combining those three problems. In the outer level of the model, we optimize the horizontal alignment and in the inner level of the model a vertical alignment optimization problem considering earthwork allocation is solved for a fixed horizontal alignment. Derivative-free optimization algorithms are used to solve the outer problem. The result of our model gives an optimal horizontal alignment in the form of a linear-circular curve and an optimal vertical alignment in the form of a quadratic spline. Our model is tested on real-life data. The numerical results show that our approach improves the road alignment designed by civil engineers by 27% on average, resulting in potentially millions of dollars of savings.     

An improved partheno genetic algorithm for multi-objective economic dispatch in cascaded hydropower systems

The multi-objective economic dispatch (MOED) problem in cascaded hydropower systems is a complicated nonlinear optimization problem with a group of complex constraints. In this paper, an improved partheno genetic algorithm (IPGA) for resolving the MOED problem in hydropower energy systems based on the non-uniform mutation operator is proposed. In the new algorithm, the crossover operator is removed and only mutation operation is made, which makes it simpler than GA in the genetic operations and not generate invalid offspring during evolution. With the help of incorporating greedy selection idea into the non-uniform mutation operator, IPGA searches the solution space uniformly at the early stage and very locally at the later stage, which makes it avoid the random blind jumping and stay at the promising solution areas. Finally, the proposed algorithm is applied to a realistic hydropower energy system with two giant scale cascaded hydropower plants in China. Compared with other algorithms, the results obtained using IPGA verify its superiority in both efficiency and precision.     

Dynamic reorder point replenishment strategies for a capacitated supply chain with seasonal demand

Managing inventory and service levels in a capacitated supply chain environment with seasonal demand requires appropriate selection and readjustment of replenishment decision variables. This study focuses on the dynamic adjustment of decision variables within supply chains using continuous-review reorder point (ROP) replenishment. A framework is proposed to adjust reorder points and lot sizes based on optimal settings within different regions of a seasonal demand cycle. This framework also includes the optimal timing of adjustments defining these regions. A discrete-event simulation model of a simple, capacity-constrained supply chain is developed and simulation–optimization experiments are performed, the objective being to minimize the total supply chain inventory subject to a target delivery service level. The performance of ROP systems with optimal static and optimal dynamic decision variable settings are compared using two different seasonal demand patterns. The results confirm that performance with dynamic decision variable adjustment is better. For a given delivery service level, average work-in-process inventory levels are almost the same for both systems. However average finished goods inventory levels decrease significantly and are more stable under dynamic adjustment. The practical implication is that both finished goods holding costs and maximum storage capacity requirements are reduced.